Unitary dilation approach to contractive matrix completion
نویسندگان
چکیده
منابع مشابه
A Simpler Approach to Matrix Completion
This paper provides the best bounds to date on the number of randomly sampled entries required to reconstruct an unknown low rank matrix. These results improve on prior work by Candès and Recht [3], Candès and Tao [6], and Keshavan, Montanari, and Oh [13]. The reconstruction is accomplished by minimizing the nuclear norm, or sum of the singular values, of the hidden matrix subject to agreement ...
متن کاملA Riemannian gossip approach to decentralized matrix completion
In this paper, we propose novel gossip algorithms for the low-rank decentralized matrix completion problem. The proposed approach is on the Riemannian Grassmann manifold that allows local matrix completion by different agents while achieving asymptotic consensus on the global low-rank factors. The resulting approach is scalable and parallelizable. Our numerical experiments show the good perform...
متن کاملA More Efficient Approach to Large Scale Matrix Completion Problems
This paper investigates a scalable optimization procedure to the low-rank matrix completion problem posed by Candes and Recht [2]. We identify the singular value decomposition as a computational bottleneck for large problem instances, and propose utilizing an approximately computed SVD borne out of recent advances in random linear algebra. We then use this approximately computed SVD to implemen...
متن کاملDecomposition Approach for Low-rank Matrix Completion
In this paper, we describe a low-rank matrix completion method based on matrix decomposition. An incomplete matrix is decomposed into submatrices which are filled with a proposed trimming step and then are recombined to form a low-rank completed matrix. The divide-and-conquer approach can significantly reduce computation complexity and storage requirement. Moreover, the proposed decomposition m...
متن کاملA Nearly Unbiased Matrix Completion Approach
Low-rank matrix completion is an important theme both theoretically and practically. However, the state-of-the-art methods based on convex optimization usually lead to a certain amount of deviation from the original matrix. To perfectly recover a data matrix from a sampling of its entries, we consider a non-convex alternative to approximate the matrix rank. In particular, we minimize a matrix γ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2004
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(03)00577-9